Regular Model Checking using Widening Techniques

Regular Model Checking Using Inference of Regular Languages

Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems...

Regular Tree Model Checking

Regular Hedge Model Checking

We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Configurations of a system are represented by trees of arbitrary arities, sets of configurations are represented by regular hedge automata, and the dynamics of a system is modeled by a regular hedge transducer. We consider the problem of computing the transitive closure T + of...

Beyond Regular Model Checking

In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...

Omega-Regular Model Checking

“Regular model checking” is the name of a family of techniques for analyzing infinite-state systems in which states are represented by words or trees, sets of states by finite automata on these objects, and transitions by finite automata operating on pairs of state encodings, i.e. finite-state transducers. In this context, the central problem is then to compute the iterative closure of a finite...